PANDA: Specifying Policies for Automated Negotiations of Service Contracts

نویسندگان

  • Henner Gimpel
  • Heiko Ludwig
  • Asit Dan
  • Robert Kearney
چکیده

The Web and Grid services frameworks provide a promising infrastructure for cross-organizational use of online services. The use of services in large-scale and cross-organizational environments requires the negotiation of agreements that define these services. Buying at a fine granularity just when a need arises is only feasible if the costs of establishing new agreements are low. Today, negotiation is often a manual process yet many simple online services would allow full or partial automation. The PANDA approach automates decision-making and proposes to specify a negotiation policy, expressing a party’s private negotiation strategy, by combining rules and utility functions. In addition, the decision-making problem can be decomposed into different aspects that can be executed by different interacting decision-makers. Using PANDA for policy specification and negotiation decision-making reduces the costs of setting up new services and contracts. Hence, the use of fine-grained ondemand services becomes feasible.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Conversation-oriented Protocols for Contract Negotiations

The expression of contracts in computer readable form, and the development of automated tests for completeness and well-formedness of contracts, has opened the door to significant advances in automating contract negotiations. To meet the needs of automation, such negotiations must follow explicitly specified message-exchange protocols. But to meet the needs of the negotiating parties, these pro...

متن کامل

Making Web services tradable: A policy-based approach for specifying preferences on Web service properties

In service-oriented architectures, applications are developed by integrated services which are often provided by different organizations. Since a service might be offered under different conditions by various different organizations, sophisticated service selection and negotiation algorithms are required. Policies capture the conditions under which services are offered or requested and thereby ...

متن کامل

Formal Specification of Web Service Contracts for Automated Negotiations and Compliance Checking

Service-oriented computing as a concept for providing interoperability and flexibility within heterogeneous environments has gained much attention within last years. Dynamically integrating external Web services into enterprise applications requires automatic contracting between service requestors and providers and automatic contract monitoring. This paper suggests semi-automatic approach since...

متن کامل

AUTOMATED NEGOTIATIONS IN O.C.E.A.N By CHAITANYA CHOKKAREDDY A THESIS PRESENTED TO THE GRADUATE SCHOOL OF THE UNIVERSITY OF FLORIDA IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER OF SCIENCE UNIVERSITY OF FLORIDA

of Thesis Presented to the Graduate School of the University of Florida in Partial Fulfillment of the Requirements for the Master of Science AUTOMATED NEGOTIATIONS IN O.C.E.A.N By Chaitanya Chokkareddy August 2002 Chair: Dr. Michael P. Frank Department: Computer and Information Science and Engineering The automation of negotiations is a real challenge in the world of e-business. The problem ste...

متن کامل

Flacos'08 Workshop Proceedings Flacos'08 Second Workshop on Formal Languages and Analysis of Contract-oriented Software Acknowledgments a Framework for Contract-based Reasoning: Motivation and Application 77 Cc-pi: a Constraint-based Language for Contracts with Service Level Agreements

Service Level Agreements are a key issue in Service Oriented Computing. SLA contracts specify client requirements and service guarantees, with emphasis on Quality of Service (cost, performance, availability, etc.). We overview a simple model of contracts for QoS and SLAs that combines two basic programming paradigms: name-passing calculi and concurrent constraint programming. In the resulting c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003